An Empirical Analysis of Likelihood-Weighting Simulation on a Large, Multiply-Connected Belief Network
نویسندگان
چکیده
We analyzed the convergence properties of likelihood weighting algorithms on a two-level, multiply connected, belief-network representation of the QMR knowledge base of internal medicine. Specifically, on two difficult diagnostic cases, we examined the effects of Markov blanket scoring, importance sampling, and self-importance sampling, demonstrating that the Markov blanket scoring and self-importance sampling significantly improve the convergence of the simulation on our model.
منابع مشابه
Updating Probabilities in Multiply-Connected Belief Networks
This paper focuses on probability updates in multiply-connected belief networks. Pearl has designed the method of conditioning, which enables us to apply his algorithm for belief updates in singly-connected networks to multiply-connected belief networks by selecting a loop-cutset for the network and instantiating these loop-cutset nodes. We discuss conditions that need to be satisfied by the se...
متن کاملModified signed log-likelihood test for the coefficient of variation of an inverse Gaussian population
In this paper, we consider the problem of two sided hypothesis testing for the parameter of coefficient of variation of an inverse Gaussian population. An approach used here is the modified signed log-likelihood ratio (MSLR) method which is the modification of traditional signed log-likelihood ratio test. Previous works show that this proposed method has third-order accuracy whereas the traditi...
متن کاملExtending Recurrence Local Computation Approach Towards Ordering Composite Beliefs in Multiply Connected Bayesian Belief Networks
The Recurrence Local Computation Method (RLCM) for nding the most probable explanations (MPE) in a Bayesian belief network is valuable in assisting human beings to explain the possible causes of a set of evidences. However, RLCM works only on singly connected belief networks. This paper presents an extension of the RLCM which can be applied to multiply connected belief networks for nding arbitr...
متن کاملA Stratified Simulation Scheme for Inference in Bayesian Belief Networks
Simulation schemes for probabilistic infer ence in Bayesian belief networks offer many advantages over exact algorithms; for ex ample, these schemes have a linear and thus predictable runtime while exact algo rithms have exponential runtime. Exper iments have shown that likelihood weight ing is one of the most promising simulation schemes. In this paper, we present a new simulation scheme ...
متن کاملOptimal Monte Carlo Estimation of Belief Network Inference
We present two Monte Carlo sampling algo rithms for probabilistic inference that guarantee polynomial-time convergence for a larger class of network than current sampling algorithms pro vide. These new methods are variants of the known likelihood weighting algorithm. We use of recent advances in the theory of optimal stopping rules for Monte Carlo simulation to obtain an inference approximati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1304.1141 شماره
صفحات -
تاریخ انتشار 2011